The incidence coloring conjecture for graphs of maximum degree 3
نویسندگان
چکیده
منابع مشابه
Incidence coloring of graphs with high maximum average degree
An incidence of an undirected graph G is a pair (v, e) where v is a vertex of G and e an edge of G incident with v. Two incidences (v, e) and (w, f) are adjacent if one of the following holds: (i) v = w, (ii) e = f or (iii) vw = e or f . An incidence coloring of G assigns a color to each incidence of G in such a way that adjacent incidences get distinct colors. In 2005, Hosseini Dolama et al. [...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملGallai's path decomposition conjecture for graphs of small maximum degree
Gallai’s path decomposition conjecture states that the edges of any connected graph on n vertices can be decomposed into at most n+1 2 paths. We confirm that conjecture for all graphs with maximum degree at most five.
متن کاملAcyclic Vertex Coloring of Graphs of Maximum Degree 4
The acyclic chromatic number of a graph G, denoted a(G), is the minimum number of colors required to properly color the vertices of a graph such that there are no bichromatic cycles. The concept of acyclic coloring of a graph was introduced by [5] and is further studied in the last two decades in several works. Kostochka [6] proves that determining it is an NP-complete problem. Given the comput...
متن کاملAcyclic Vertex Coloring of Graphs of Maximum Degree
An acyclic vertex coloring of a graph is a proper vertex coloring such that there are no bichromatic cycles. The acyclic chromatic number of G, denoted a(G), is the minimum number of colors required for acyclic vertex coloring of graph G = (V,E). For a family F of graphs, the acyclic chromatic number of F , denoted by a(F), is defined as the maximum a(G) over all the graphs G ∈ F . In this pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2005
ISSN: 0012-365X
DOI: 10.1016/j.disc.2005.02.003